#include <iostream>
using namespace std;
int main()
{
  long long a = (long long)256 * 1024 * 1024 * 8;
  a /= 32;
  cout << a << endl;
  return 0;
}
#include <iostream>
using namespace std;
int main()
{
  long long n = 0,k = 1;  cin>>n;
  while(true){
    long long t = k * (k + 1)/2;
    if(t >= n) 
    {
      cout << k << endl;
      return 0;
    }
    k++;
  }
  return 0;
}
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int lenx = 20,leny = 21; 
vector<vector<set<double> > >window(20,vector<set<double> >(21));

bool check(int x,int y,int nx,int ny){
  if(y == ny) 
  	return false;
  double k = (double)(x - nx) / (double)(y - ny);
  bool t = window[x][y].count(k) || window[nx][ny].count(k);
  window[x][y].insert(k);
  window[nx][ny].insert(k);
  return !t;
}
int main()
{
  int ans = 0;
  for(int x = 0;x < lenx;x++){
    for(int y = 0;y < leny;y++){
      for(int nx = 0;nx < lenx;nx++){
        for(int ny = 0;ny < leny;ny++){
          if(check(x,y,nx,ny)){
          	//cout << x <<' ' << y << ' ' << nx << ny << endl;
            ans++;
          }
        } 
      }
    }
  }
  cout << ans + leny << endl;
  return 0;
}
#include <iostream>
#include <map>
using namespace std;
using ll = long long;
int main()
{
  map<int,int> cnt;
  ll n = 2021041820210418;
  // ll n = 4;
  ll ans = 1;
  for(ll a = 2; a <= n;a++){
    while(n % a == 0){
      cnt[a]++;
      n/=a;
      ans *= 3;
    }
  }
  // cout << n << endl;
  // for(auto& e : cnt){
  //   cout<< e .first <<' ' << e.second << endl;
  // }
  // cout << 1 << endl;
  cout << ans / 27 * 10<< endl;
  return 0;
}
// 1
// 2 1
// 3 3
// 17 1
// 131 1
// 2857 1
// 5882353 1
#include <iostream>
using ll = long long;
using namespace std;
ll dp[2025];
ll fun(ll a,ll b){
  if(b == 0) return a;
  return fun(b,a%b);
}
int main()
{
  dp[1] = 0;
  for(ll pos = 2;pos <= 2021;pos++){
    dp[pos] = 10000000000;
    for(ll left = max(pos - 21,(ll)1);left < pos;left++){
      ll a = fun(pos,left);
      dp[pos] = min(dp[pos],dp[left] + pos * left /a);
    }
  }
  // for(int i = 0;i < 10;i++){
  //   cout << dp[i] << endl;
  // }
  cout << dp[2021] << endl;
  return 0;
}
#include <iostream>
using namespace std;


bool fun(int year){
  return year % 400 == 0 || (year%100 != 0 && year%4 == 0);
}
int main()
{
  long long a;  cin>>a;
  a /= 1000;
  int year = 1970;
  long long yearfortime;
  while(true){
    if(fun(year)){
      yearfortime = 366 * 24 * 60 * 60;
    }else{
      yearfortime = 365 * 24 * 60 * 60;
    }
    if(yearfortime > a) break;
    a -= yearfortime;
  }
  // cout << a << endl;
  int second = a % 60;
  a /=60;
  int minute = a % 60;
  a /= 60;
  int houre = a % 24;
  printf("%02d:%02d:%02d",houre,minute,second);
  return 0;
}
#include <iostream>
using namespace std;
int olddp[200005];
int newdp[200005];
int main()
{
  int n;  cin>>n;
  for(int i = 0;i < n;i++){
    int t;  cin>>t;
    for(int j = 1;j < 100005;j++){
      if(olddp[j] == 1){
        if(j - t > 0) newdp[j - t] = 1; 
        if(j - t < 0) newdp[t - j] = 1; 
        newdp[t + j] = 1;
      }
    }
    newdp[t] = 1;
    for(int j = 1;j < 100005;j++){
      olddp[j] = newdp[j];
    }
  }
  int ans = 0;
  for(int j = 1;j < 100005;j++){
    // if(olddp[j] == 1) cout << j <<' ';
      ans += olddp[j];
  }
  cout << ans << endl;
  return 0;
}
#include <iostream>
using namespace std;
using ll = long long;
int main()
{
  long long n;  cin>>n;
  if(n == 1){
    cout<< 1 << endl;
    return 0;
  }
  ll ans = 0,len = 3;
  while(true){
    for(int pos = 2;pos <= len;pos++){
      ll a = 1;
      for(int i = 1;i < pos;i++){
        a *= (len - i); 
      }
      for(int i = 1;i < pos;i++){
        a /= i; 
      }
      if(a == n){
        ans = pos + (len - 1) * len /2;
        cout << ans << endl;
        return 0;
      }
    }
    len++;
  }
  cout << ans << endl;
  return 0;
}
#include <iostream>
#include <algorithm>
using namespace std;
int arr[100005];
int q[100005];
int p[100005];
bool fun(int a,int b){
	return a > b;
}
int main()
{
  int n,m;  cin>>n>>m;
  for(int i = 1;i <=n;i++)  arr[i] = i;
  for(int i = 1;i <=m;i++){
    cin>>p[i]>>q[i];
  }
  int cntp = p[0],cntq = q[0];
  for(int i = 1;i <=m;i++){
    if(cntp == p[i]){
      if(cntp == 0) cntq = max(cntq,q[i]);
      if(cntp == 1) cntq = min(cntq,q[i]);
    }else{
      if(cntp == 0) sort(arr+1,arr + cntq + 1,fun);
      if(cntp == 1) sort(arr+cntq,arr + n + 1);
      cntp = p[i],cntq = q[i];
    }
    // for(int i = 1;i <=n;i++)  cout<< arr[i] <<' ';
    // cout << endl;
  }
  if(cntp == 0) sort(arr+1,arr + cntq + 1,fun);
  if(cntp == 1) sort(arr+ cntq,arr + n + 1);
  for(int i = 1;i <=n;i++)  cout<< arr[i] <<' ';
  return 0;
}